Pervasive Data Access in Wireless and Mobile Computing Environments

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. with wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey paper reviews important works in two important dimensions of pervasive data access: data broadcast and client caching. In addition, data access techniques aiming at various application requirements (such as time, location, semantics and reliability) are covered

Robust pinning of magnetic moments in pyrochlore iridates

Pyrochlore iridates A2Ir2O7 (A = rare earth elements, Y or Bi) hold great promise for realizing novel electronic and magnetic states owing to the interplay of spin-orbit coupling, electron correlation and geometrical frustration. A prominent example is the formation of all-in/all-out (AIAO)antiferromagnetic order in the Ir4+ sublattice that comprises of corner-sharing tetrahedra. Here we report on an unusual magnetic phenomenon, namely a cooling-field induced shift of magnetic hysteresis loop along magnetization axis, and its possible origin in pyrochlore iridates with non-magnetic Ir defects (e.g. Ir3+). In a simple model, we attribute the magnetic hysteresis loop to the formation of ferromagnetic droplets in the AIAO antiferromagnetic background. The weak ferromagnetism originates from canted antiferromagnetic order of the Ir4+ moments surrounding each non-magnetic Ir defect. The shift of hysteresis loop can be understood quantitatively based on an exchange-bias like effect in which the moments at the shell of the FM droplets are pinned by the AIAO AFM background via mainly the Heisenberg (J) and Dzyaloshinsky-Moriya (D) interactions. The magnetic pinning is stable and robust against the sweeping cycle and sweeping field up to 35 T, which is possibly related to the magnetic octupolar nature of the AIAO order.Comment: 16 pages, 4 figure

Fast Object Search on Road Networks

In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search space pruning technique and providing a dynamic ob-ject mapping mechanism, ROAD is very efficient and flexible for various types of queries, namely, range search and near-est neighbor search, on objects over large-scale networks. ROAD is named after its two components, namely, Route Overlay and Association Directory, designed to address the network traversal and object access aspects of the frame-work. In ROAD, a large road network is organized as a hier-archy of interconnected regional sub-networks (called Rnets) augmented with 1) shortcuts for accelerating network traver-sals; and 2) object abstracts for guiding traversals. In this pa-per, we present (i) the Rnet hierarchy and several properties useful to construct Rnet hierarchy, (ii) the design and im-plementation of the ROAD framework, (iii) efficient object search algorithms for various queries, and (iv) incremental update techniques for framework maintenance in presence of object and network changes. We conducted extensive ex-periments with real road networks to evaluate ROAD. The experiment result shows the superiority of ROAD over the state-of-the-art approaches

ROAD: A New Spatial Object Search Framework for Road Networks

Abstract—In this paper, we present a new system framework called ROAD for spatial object search on road networks. ROAD is extensible to diverse object types and efficient for processing various location-dependent spatial queries (LDSQs), as it maintains objects separately from a given network and adopts an effective search space pruning technique. Based on our analysis on the two essential operations for LDSQ processing, namely, network traversal and object lookup, ROAD organizes a large road network as a hierarchy of interconnected regional subnetworks (called Rnets). Each Rnet is augmented with 1) shortcuts and 2) object abstracts to accelerate network traversals and provide quick object lookups, respectively. To manage those shortcuts and object abstracts, two cooperating indices, namely, Route Overlay and Association Directory are devised. In detail, we present 1) the Rnet hierarchy and several properties useful in constructing and maintaining the Rnet hierarchy, 2) the design and implementation of the ROAD framework, and 3) a suite of efficient search algorithms for single-source LDSQs and multisource LDSQs. We conduct a theoretical performance analysis and carry out a comprehensive empirical study to evaluate ROAD. The analysis and experiment results show the superiority of ROAD over the state-of-the-art approaches. Index Terms—Location-dependent spatial query, spatial road network, indexing techniques, and search algorithms. Ç

Searching correlated objects in a long sequence

National Science Foundatio

OPAQUE: Protecting Path Privacy in Directions Search

2008-2009 > Academic research: refereed > Refereed conference pape

Utility-Oriented K-Anonymization on Social Networks

Office of Research, Singapore Management Universit